Matching Integral Graphs of Small Order
author
Abstract:
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matching integral claw-free graph and K_2 is the only connected matching integral graph with a perfect matching. In this work, we characterize mathching integral graphs according to their order. We determine all connected matching integral graphs on at most seven vertices. We show that there are exactly eight matching integral graphs up to seven vertices. In addition, we prove that any connected matching integral graph on eight vertices has a 3-matching and its size is fourteen. Finally, we characterize all connected matching integral graphs with maximum vertex degrees at most three.
similar resources
THE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
full textBorderenergetic graphs of order 12
A graph G of order n is said to be borderenergetic if its energy is equal to 2n-2 and if G differs from the complete graph Kn. The first such graph was discovered in 2001, but their systematic study started only in 2015. Until now, the number of borderenergetic graphs of order n was determined for n
full textIntegral circulant graphs of prime power order with maximal energy
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors of n in such a way that they have vertex set Zn and edge set {{a, b} : a, b ∈ Zn, gcd(a− b, n) ∈ D}. Using tools from convex optimization, we study the maxim...
full textIntegral Circulant Ramanujan Graphs of Prime Power Order
A connected ρ-regular graph G has largest eigenvalue ρ in modulus. G is called Ramanujan if it has at least 3 vertices and the second largest modulus of its eigenvalues is at most 2 √ ρ− 1. In 2010 Droll classified all Ramanujan unitary Cayley graphs. These graphs of type ICG(n, {1}) form a subset of the class of integral circulant graphs ICG(n,D), which can be characterised by their order n an...
full textEvolutionary Dynamics on Small-order Graphs
We study the stochastic birth-death model for structured finite populations popularized by Lieberman et al. [Lieberman, E., Hauert, C., Nowak, M.A., 2005. Evolutionary dynamics on graphs. Nature 433, 312-316]. We consider all possible connected undirected graphs of orders three through eight. For each graph, using the Monte Carlo Markov Chain simulations, we determine the fixation probability o...
full textClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
full textMy Resources
Journal title
volume 6 issue 26
pages 99- 110
publication date 2020-10-22
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023